#include<iostream>
using namespace std;

#include"BinarySearchTree.h"
int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	key::BSTree<int>  bt;
	for (auto e : a)
	{
		//bt.InsertR(e);
		bt.insert(e);
	}
	bt.InOrder();


	/*for (auto e : a)
	{
		cout << e << endl;
	}*/
	

	return 0;
}